Inductive Algebras for Trees
نویسندگان
چکیده
Let G be a locally compact group and π : G → U(H) a unitary representation of G. A commutative subalgebra of B(H) is called π-inductive when it is stable through conjugation by every operator in the range of π. This concept generalizes Mackey’s definition of a system of imprimitivity for π; it is expected that studying inductive algebras will lead to progress in the classification of realizations of representations on function spaces. In this paper we take as G the automorphism group of a locally finite homogeneous tree; we consider the principal spherical representations of G, which act on a Hilbert space of functions on the boundary of the tree, and classify the maximal inductive algebras of such representations. We prove that, in most cases, there exist exactly two such algebras.
منابع مشابه
Interleaving data and effects
The study of programming with and reasoning about inductive datatypes such as lists and trees has benefited from the simple categorical principle of initial algebras. In initial algebra semantics, each inductive datatype is represented by an initial f-algebra for an appropriate functor f. The initial algebra principle then supports the straightforward derivation of definitional principles and p...
متن کاملBlaschke Inductive Limits of Uniform Algebras
We consider and study Blaschke inductive limit algebras A(b), defined as inductive limits of disc algebras A(D) linked by a sequence b = {Bk}k=1 of finite Blaschke products. It is well known that big G-disc algebras AG over compact abelian groups G with ordered duals Γ = Ĝ ⊂Q can be expressed as Blaschke inductive limit algebras. Any Blaschke inductive limit algebraA(b) is a maximal and Dirichl...
متن کاملInductive Limits of Subhomogeneous C∗-algebras with Hausdorff Spectrum
We consider unital simple inductive limits of generalized dimension drop C∗-algebras They are so-called ASH-algebras and include all unital simple AH-algebras and all dimension drop C∗-algebras. Suppose that A is one of these C∗-algebras. We show that A ⊗ Q has tracial rank no more than one, where Q is the rational UHF-algebra. As a consequence, we obtain the following classification result: Le...
متن کاملNon-Wellfounded Trees in Homotopy Type Theory
Coinductive data types are used in functional programming to represent infinite data structures. Examples include the ubiquitous data type of streams over a given base type, but also more sophisticated types. From a categorical perspective, coinductive types are characterized by a universal property, which specifies the object with that property uniquely in a suitable sense. More precisely, a c...
متن کاملThe Classification of Separable Simple C*-algebras Which Are Inductive Limits of Continuous-trace C*-algebras with Spectrum Homeomorphic to the Closed Interval [0,1]
A classification is given of certain separable nuclear C*algebras not necessarily of real rank zero, namely, the class of separable simple C*-algebras which are inductive limits of continuoustrace C*-algebras whose building blocks have spectrum homeomorphic to the closed interval [0, 1], or to a disjoint union of copies of this space. Also, the range of the invariant is calculated. 1991 Mathema...
متن کامل